Algebraic State Transition Diagrams
نویسندگان
چکیده
This paper introduces a graphical notation called algebraic state transition diagrams (ASTD), which allows for the combination of state transition diagrams using classical process algebra operators like sequence, iteration, parallel composition, quantified choice and quantified synchronization. It is inspired from automata, statecharts and process algebras. Hence, it combines the strength of all these notations: graphical representation, hierarchy, orthogonality, compositionality, abstraction. Quantification is one of the salient features of ASTDs, because it provides a powerful mechanism for modeling an arbitrary number of instances of an ASTD. A formal operational semantics is given. Our target application domain is the specification of information systems, but ASTDs are presented in a generic manner.
منابع مشابه
SHERBROOKE Algebraic State Transition Diagrams
This paper introduces a graphical notation called algebraic state transition diagrams (ASTD), which allows for the combination of state transition diagrams using classical process algebra operators like sequence, iteration, parallel composition, quantified choice and quantified synchronization. It is inspired from automata, statecharts and process algebras. Hence, it combines the strength of al...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملAlgebraic Properties of Cellular Automata
Cellular automata are discrete dynamical systems, of simple construction but complex and varied behaviour. Algebraic techniques are used to give an extensive analysis of the global properties of a class of finite cellular automata. The complete structure of state transition diagrams is derived in terms of algebraic and number theoretical quantities. The systems are usually irreversible, and are...
متن کاملColor Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules
-. Two-dimensional nine neighbor hood rectangular Cellular Automata rules can be modeled using many different techniques like Rule matrices, State Transition Diagrams, Boolean functions, Algebraic Normal Form etc. In this paper, a new model is introduced using color graphs to model all the 512 linear rules. The graph theoretic properties therefore studied in this paper simplifies the analysis o...
متن کاملAlgebraic Specification of Reactive Systems
We present an algebraic method for the specification of reactive distributed systems. We introduce basic operators on specifications making the set of specifications into a specification algebra. This allows us to work with an algebra of system specifications in analogy to the process algebras that provide algebras of reactive programs. However, in contrast to process algebras we work with a co...
متن کامل